#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL lcm(LL A,LL B){
   return A/__gcd(A,B)*B;
}
int main(void){
   ////cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL r,b,k;cin>>r>>b>>k;
      if(r>b) swap(r,b);
      LL cnt=(b%r==0);
      LL num1=b/r-cnt;
      if(num1>=k){
         cout<<"REBEL"<<"\n";
       ///  cout<<"fu"<<"\n";
      }
      else{

         LL num2=(lcm(r,b))/r-1-b/r;
         if(num2>=k){
            cout<<"REBEL"<<"\n";
         }
         else{
            cout<<"OBEY"<<"\n";
         }
      }
   }
   return 0;
}
